An electronic voting scheme based on SM2 blind threshold signature was proposed to address the security and efficiency issues in the algorithm protocol layer of domestic electronic election system. Firstly，the SM2 threshold blind signature algorithm was constructed based on the SM2 signature algorithm，the methods of Shamir secret sharing， Random Secret Sharing （RSS）， secret sum， difference and product sharing， and Inversion Secret Sharing （ISS） were used to share the secret private key and random number in SM2 signature algorithm without changing the original signature process. At the same time，a blinding factor was introduced to blind the message to be signed， achieving the privacy protection of the message sender and effective sharing of sensitive information. Secondly，the algorithm security analysis results show that， the constructed blind signature algorithm has blindness， robustness，and non-forgeability under the random oracle model. Compared with the existing RSA （Rivest-Shamir-Adleman） and Elliptic Curve Digital Signature Algorithm （ECDSA） threshold blind signature algorithms，the constructed SM2 threshold blind signature algorithm has the advantages of low computational complexity and small computational cost， making it suitable for large-scale elections. Finally， a secure electronic voting protocol was designed based on the SM2 threshold blind signature algorithm. The analysis results show that the proposed protocol has properties such as non-forgeability， confidentiality， legality， and robustness. Furthermore， a single voting process can be completed in just 15.706 1 ms.

Focused on the issue that the current online conference digital review system cannot ensure the privacy of reviewers’ opinions and obtain safe and reliable results at the same time， a privacy computing based design scheme of digital review system for online conference was proposed. Firstly， the review data were shared secretly through the encoding matrix of Reed-Solomon （RS） code to obtain secret shares， and the hash code of each party’s review data was submitted to the organizer as a stub to prevent denial. Secondly， the secret shares were cooperatively computed by the monotone expansion matrix， one encoding matrix， to obtain the voting results. Finally， the parity check matrix was used to check whether there was a sharing error or tampering behavior of the secret shares in the process of multi-party cooperative computing. Theoretical analysis and simulation show that the proposed scheme can realize the privacy computing function in the digital review system for small- and medium-sized online conferences.